Strategies for Sequential Prediction of Stationary Time Series
نویسندگان
چکیده
منابع مشابه
Sequential Network Construction for Time Series Prediction
This paper introduces an application of the Sequential Network Construction ( snc) method to select the size of several popular neural network predictor architectures for various benchmark training sets. The specific architectures considered are a fir network and the partially recurrent Elman network and its extension, with context units also added for the output layer. We consider an enhanceme...
متن کاملNonparametric sequential prediction of time series
Time series prediction covers a vast field of every-day statistical applications in medical, environmental and economic domains. In this paper we develop nonparametric prediction strategies based on the combination of a set of “experts” and show the universal consistency of these strategies under a minimum of conditions. We perform an indepth analysis of real-world data sets and show that these...
متن کاملSome New Methods for Prediction of Time Series by Wavelets
Extended Abstract. Forecasting is one of the most important purposes of time series analysis. For many years, classical methods were used for this aim. But these methods do not give good performance results for real time series due to non-linearity and non-stationarity of these data sets. On one hand, most of real world time series data display a time-varying second order structure. On th...
متن کاملSpectral Estimation of Stationary Time Series: Recent Developments
Spectral analysis considers the problem of determining (the art of recovering) the spectral content (i.e., the distribution of power over frequency) of a stationary time series from a finite set of measurements, by means of either nonparametric or parametric techniques. This paper introduces the spectral analysis problem, motivates the definition of power spectral density functions, and reviews...
متن کاملGeneralization Bounds for Time Series Prediction with Non-stationary Processes
This paper presents the first generalization bounds for time series prediction with a non-stationary mixing stochastic process. We prove Rademacher complexity learning bounds for both average-path generalization with non-stationary β-mixing processes and path-dependent generalization with non-stationary φ-mixing processes. Our guarantees are expressed in terms of βor φ-mixing coefficients and a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2000
ISSN: 1556-5068
DOI: 10.2139/ssrn.248563